Brief Annoucement: Snap-Stabilization in Message-Passing Systems
نویسندگان
چکیده
In this announcement, we report recent results where we address the open problem of snap-stabilization in messagepassing systems. (A full version of this paper is available as [3] at http://arxiv.org/abs/0802.1123.)
منابع مشابه
Snap-Stabilization in Message-Passing Systems Brief Announcement
In this announcement, we report recent results [4] (available at http://arxiv.org/abs/0802. 1123) where we address the open problem of snap-stabilization in message-passing systems. The concept of snap-stabilization [3] offers an attractive approach to transient fault tolerance. As soon as such fault ends a snap-stabilizing protocol immediately operates correctly. Of course, not all safety pred...
متن کاملSnap-Stabilizing PIF on Non-oriented Trees and Message Passing Model
Starting from any configuration, a snap-stabilizing protocol guarantees that the system always behaves according to its specification while a self-stabilizing protocol only guarantees that the system will behave according to its specification in a finite time. So, a snap-stabilizing protocol is a time optimal self-stabilizing protocol (because it stabilizes in 0 rounds). That property is very s...
متن کاملTwo snap-stabilizing point-to-point communication protocols in message-switched networks
A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we present a snap-stabilizing protocol to solve the message forwarding problem in a message-switched network. In this problem, we must manage resources of the system to deliver messages to any processor of the network. In this purpose, we use information given by a routing...
متن کاملProbabilistic Snap-Stabilizing Algorithms for Local Resource Allocation Problems
Scientific Context. Modern networks are very large-scale (about 100 000 nodes). Now, the more a network contains nodes, the greater the probability of failures is. Hence, today fault-tolerance is a main concern for distributed algorithm designers. In particular, since several decades, there is a growing interest for self-repairing methods. For example, (deterministic) self-stabilization [Dij74]...
متن کاملBrief Announcement: Sharing Memory in a Self-stabilizing Manner
Introduction. A core abstraction for many distributed algorithms simulates shared memory [3]; this abstraction allows to take algorithms designed for shared memory, and port them to asynchronous message-passing systems, even in the presence of failures. There has been significant work on creating such simulations, under various types of permanent failures, as well as on exploiting this abstract...
متن کامل